A distributed diffusion method for dynamic load balancing on parallel computers
نویسندگان
چکیده
Abstract. Parallel application can be divided into tasks that can be executed simultaneously. A mechanism for assigning these tasks to the processors is required. The objective is to minimize the overall execution time of a single application running in parallel on a multicomputer system. We propose a new dynamic load balancing algorithm based on the diffusion approach which employs overlapping balancing domains (a processor and its neighbors) to achieve global balancing. Since current diffusion methods consider discrete units, the algorithms may produce solutions which, although they are locally balanced, prove to be globally unbalanced. Our method solves this problem taking into account the load maximum difference between two processors within each domain, providing a more efficient load balancing process. This method is performed in a distributed fashion and can easily be scaled to support highly parallel machines. The algorithm has been applied to different interconnection networks and the results obtained are very encouraging
منابع مشابه
Load Balancing for Parallel Computing on Distributed Computers
Distributed processing can be used for solving large computation intensive problems. A distributed system may include parallel supercomputers, networked workstations and PCs. This paper discusses load balancing of a parallel job in a distributed computation environment. The information necessary for load balancing is studied. The software tools that automatically collect the information and per...
متن کاملMolecular Dynamics with Load Balancing on Distributed - Memory Mimd Computers
We report two aspects of a computational molecular dynamics study of large-scale problems on a distributed-memory MIMD parallel computer: (1) efficiency and scalability results on Intel Paragon parallel computers with up to 512 nodes and (2) a new method for dynamic load balancing.
متن کاملRunning Finite-difference Schemes for 3d Diffusion Problems on Parallel Computers with Distributed Memory
In this papper we consider the problem of solving 3D diffusion problems on distributed memory computers. We present a parallel algorithm that is suitable for the number of processors less or equal 8. The pipelining method is used to enlarge the number of processors till 64. The computational grid decomposition method is proposed for heterogenous clusters of workstations which preserves the load...
متن کاملA Provably Optimal, Distribution-Independent Parallel Fast Multipole Method
The Fast Multipole Method (FMM) is a robust technique for the rapid evaluation of the combined e ect of pairwise interactions of n data sources. Parallel computation of the FMM is considered a challenging problem due to the dependence of the computation on the distribution of the data sources, usually resulting in dynamic data decomposition and load balancing problems. In this paper, we present...
متن کاملEfficiency of Dynamic Load Balancing Based on Permanent Cells for Parallel Molecular Dynamics Simulation
This paper addresses a dynamic load balancing method of domain decomposition for 3-dimensional Molecular Dynamics on parallel computers. In order to reduce interprocessor communication overhead, we are introducing a concept of permanent cells to the dynamic load balancing method. Molecular Dynamics simulations on a parallel computer T3E prove that the proposed method using load balancing much i...
متن کامل